Distance rationalization of voting rules
نویسندگان
چکیده
The concept of distance rationalizability allows one to define new voting rules or rationalize existing ones via a consensus, i.e., a class of elections that have a unique, indisputable winner, and a distance over elections: A candidate is declared an election winner if she is the consensus candidate in one of the nearest consensus elections. Many classic voting rules are defined or can be represented in this way. In this paper, we focus on the power and the limitations of the distance rationalizability approach. Lerer and Nitzan (1985) and Campbell and Nitzan (1986) show that if we do not place any restrictions on the notions of distance and consensus then essentially all voting rules can be distance-rationalized. We identify a natural class of distances on elections— votewise distances—which depend on the submitted votes in a simple and transparent manner, and investigate which voting rules can be rationalized via distances of this type. We also study axiomatic properties of rules that can be defined via votewise distances.
منابع مشابه
Universal and Symmetric Scoring Rules for Binary Relations
Are Plurality voting, the Kemeny rule, Approval voting, and the Borda Mean Dichotomy rule all versions of the same voting rule? Yes, in a sense. In an extension of work by Barthélemy and Monjardet [3], we consider functions F that assign real number scoring weights F (R1, R2) to pairs of binary relations on a finite set A of alternatives, serving as symmetric measures of similarity between R1 a...
متن کاملDistance rationalization of anonymous and homogeneous voting rules
The concept of distance rationalizability of voting rules has been explored in recent years by several authors. Most previous work has dealt with a definition in terms of preference profiles. However, most voting rules in common use are anonymous and homogeneous. In this case there is a much more succinct representation (using the voting simplex) of the inputs to the rule. This representation h...
متن کاملA Dynamic Rationalization of Distance Rationalizability
Distance rationalizability is an intuitive paradigm for developing and studying voting rules: given a notion of consensus and a distance function on preference profiles, a rationalizable voting rule selects an alternative that is closest to being a consensus winner. Despite its appeal, distance rationalizability faces the challenge of connecting the chosen distance measure and consensus notion ...
متن کاملOn the role of distances in defining voting rules
A voting rule is an algorithm for determining the winner in an election, and there are several approaches that have been used to justify the proposed rules. One justification is to show that a rule satisfies a set of desirable axioms that uniquely identify it. Another is to show that the calculation that it performs is actually maximum likelihood estimation relative to a certain model of noise ...
متن کاملHomogeneity and monotonicity of distance-rationalizable voting rules
Distance rationalizability is a framework for classifying existing voting rules by interpreting them in terms of distances and consensus classes. It also allows to design new voting rules with desired properties. A particularly natural and versatile class of distances that can be used for this purpose is that of votewise distances [EFS10b], which “lift” distances over individual votes to distan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Social Choice and Welfare
دوره 45 شماره
صفحات -
تاریخ انتشار 2015